A Hierarchy of Implementable MSC Languages

نویسندگان

  • Benedikt Bollig
  • Martin Leucker
چکیده

We develop a unifying theory of message-passing automata (MPAs) and MSC languages. We study several variants of regular as well as product MSC languages, their closure under finite union and their intersection. Furthermore, we analyse the expressive power of several variants of MPAs and characterize the language classes of interest by the corresponding classes of MPAs.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Hierarchy of Communication Models for Message Sequence Charts

In a Message Sequence Chart (MSC) the dynamical behaviour of a number of cooperating processes is depicted. An MSC defines a partial order on the communication events between these processes. This order determines the physical architecture needed for implementing the specified behaviour, such as a FIFO buffer between each of the processes. In a systematic way, we define 50 communication models ...

متن کامل

The Pros and Cons of Netcharts

Netcharts have been introduced recently by Mukund et al. in [17]. This new appealing approach to the specification of collections of message sequence charts (MSCs) benefits from a graphical description, a formal semantics based on Petri nets, and an appropriate expressive power. As opposed to high-level MSCs, any regular MSC language is the language of some netchart. Motivated by two open probl...

متن کامل

Message-Passing Automata Are Expressively Equivalent to EMSO Logic

We study the expressiveness of finite message-passing automata with a priori unbounded channels and show them to capture exactly the class of MSC languages that are definable in existential monadic second-order logic interpreted over MSCs. Moreover, we prove the monadic quantifier-alternation hierarchy over MSCs to be infinite and conclude that the class of MSC languages accepted by message-pas...

متن کامل

Literally idempotent languages and their varieties - two letter case

A language L ⊆ A∗ is literally idempotent in case that uav ∈ L if and only if uav ∈ L, for each u, v ∈ A∗, a ∈ A. We already studied classes of such languages closely related to the (positive) varieties of the famous StraubingThérien hierarchy. In the present paper we start a systematic study of literal varieties of literally idempotent languages, namely we deal with the case of two letter alph...

متن کامل

The Most Prominent Theta Roles in the Sindhi Language: The Hierarchy

Abstract This paper focuses on the most prominent theta roles used in the Sindhi language. The study attempts to answer to the research question, ‘How are theta roles prominently used in the Sindhi language?’ The data come from the young native Sindhi speakers. Each verb phrase in the data is examined with the help of Carnie’s (2007) ‘Theta Roles and Thematic Relations’ in order to find the pro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005